Normal Cayley digraphs of dihedral groups with CI-property

نویسندگان

چکیده

A Cayley (di)graph Cay(G,S) of a group G with respect to set S ⊆ is said be normal if the image under its right regular representation in automorphism Cay(G,S), and called CI-(di)graph for every T Cay(G,S)≅ Cay(G,T), there α∈ Aut(G) such that Sα = T. finite DCI-group or an NDCI-group all digraphs are CI-digraphs, respectively, CI-group NCI-group graphs CI-graphs, respectively. Motivated by conjecture proposed Ádám 1967, CI-groups DCI-groups have been actively studied during last fifty years many researchers algebraic graph theory. It took about thirty obtain classification cyclic DCI-groups, recently, first two authors, among others, classified NCI-groups NDCI-groups. Even though partial results on dihedral their still elusive. In this paper, we prove order 2n only n 2, 4 odd. As direct consequence, D2n then 2 odd-square-free, 9 throwing some new light DCI-groups. byproduct, construct non-CI D8, but Holt Royle [A census small transitive groups vertex-transitive graphs, J. Symbolic Comput. 101 (2020) 51-60] claimed D8 algorithm there.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On isomorphisms of Cayley digraphs on dihedral groups

In this paper, we investigate m-DCI and m-CI properties of dihedral groups. We show that for any m E {I, 2, 3}, the dihedral group D2k is m-DCI if and only if D2k is m-CI if and only if 2 f k. § 1. Preliminaries Let G be a finite group and 5 a subset of G with 1 1:. 5. We use r = Cay( G; 5) to denote the Cayley digraph of G with respect to 5, defined to be the directed graph with vertex set and...

متن کامل

On Hamilton Circuits in Cayley Digraphs over Generalized Dihedral Groups

In this paper we prove that given a generalized dihedral group DH and a generating subset S, if S∩H 6= ∅ then the Cayley digraph → Cay(DH , S) is Hamiltonian. The proof we provide is via a recursive algorithm that produces a Hamilton circuit in the digraph.

متن کامل

On the eigenvalues of Cayley graphs on generalized dihedral groups

‎Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$‎. ‎Then the energy of‎ ‎$Gamma$‎, ‎a concept defined in 1978 by Gutman‎, ‎is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$‎. ‎Also‎ ‎the Estrada index of $Gamma$‎, ‎which is defined in 2000 by Ernesto Estrada‎, ‎is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$‎. ‎In this paper‎, ‎we compute the eigen...

متن کامل

Diameter 2 Cayley graphs of dihedral groups

We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree d. We completely determine the asymptotic behaviour of this class of graphs by showing that both limits are asymptotically d/2.

متن کامل

Distance-regular Cayley graphs on dihedral groups

The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ars Mathematica Contemporanea

سال: 2023

ISSN: ['1855-3974', '1855-3966']

DOI: https://doi.org/10.26493/1855-3974.2688.2de